An exact correspondence between a typed pi-calculus and polarised proof-nets
نویسندگان
چکیده
This paper presents an exact correspondence in typing and dynamics between polarised linear logic and a typed π-calculus based on IO-typing. The respective incremental constraints, one on geometric structures of proof-nets and one based on types, precisely correspond to each other, leading to the exact correspondence of the respective formalisms as they appear in [Lau03] (for proof-nets) and [HYB04] (for the π-calculus).
منابع مشابه
A Proof Theoretical Approach to Communication
The paper investigates a concurrent computation model, chi calculus, in which communications resemble cut eliminations for classical proofs. The algebraic properties of the model are studied. Its relationship to sequential computation is illustrated by showing that it incorporates the operational semantics of the call-by-name lambda calculus. Practically the model has pi calculus as a submodel....
متن کاملStrong Normalization of Explicit Substitutions via Cut Elimination in Proof Nets
In this paper, we show the correspondence existing between normalization in calculi with explicit substitution and cut elimination in sequent calculus for Linear Logic,via Proof Nets. This correspondence allows us to prove that a typed version of the λx-calculus [34, 5] is strongly normalizing, as well as of all the calculi that can be translated to it keeping normalization properties such as λ...
متن کاملStrong Normalization of Explicit Substitutions via Cut Elimination in Proof Nets (Extended Abstract)
In this paper, we show the correspondence existing between normalization in calculi with explicit substitution and cut elimination in sequent calculus for Linear Logic, via Proof Nets. This correspondence allows us to prove that a typed version of the λx-calculus [30, 29] is strongly normalizing, as well as of all the calculi isomorphic to it such as λυ [24], λs [19], λd [21], and λf [11]. In o...
متن کاملMultiparty Sessions based on Proof Nets
Since their inception, sessions [12, 19] and multiparty sessions [11] have been gaining momentum as a very useful foundation for the description and verification of structured interactions. Interestingly, recent works have established a close correspondence between typed, synchronous pi-calculus processes and sequent proofs of a variation of Intuitionistic Linear Logic [3]. This particular inte...
متن کاملProof Nets in Process Algebraic Form
We present δ-calculus, a computational interpretation of Linear Logic, in the form of a typed process algebra whose structures correspond to Proof Nets, and where typing derivations correspond to linear sequent proofs. Term reduction shares the properties of cut elimination in the logic, and immediately we can obtain a number of inherited qualities, among which are termination, deadlock-freedom...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Theor. Comput. Sci.
دوره 411 شماره
صفحات -
تاریخ انتشار 2010